The Tutte polynomial characterizes simple outerplanar graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tutte Polynomial Characterizes Simple Outerplanar Graphs

We show that if G is a simple outerplanar graph and H is a graph with the same Tutte polynomial as G, then H is also outerplanar. Examples show that the condition of G being simple cannot be omitted.

متن کامل

A Polynomial-time Metric for Outerplanar Graphs

Graphs are mathematical structures that are capable of representing relational data. In the chemoinformatics context, they have become very popular for the representation of molecules. However, a lot of operations on graphs are NP-complete, so no efficient algorithms that can handle these structures exist. In this paper we focus on outerplanar graphs, a subclass within general graphs. Most mole...

متن کامل

Tutte Polynomial of Multi-Bridge Graphs

In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some 2−tree graphs. Further, several recursive formulae for other graphs such as the fan and the wheel graphs are also discussed.

متن کامل

Tutte polynomial expansions for 2-separable graphs

Let Ĝ be a graph obtained from a graph G with no loops or coloops by replacing each edge e= uw of G by a connected graph He that has only the vertices u and w in common with the rest of Ĝ. Two mutually dual formulas are proved for the Tutte polynomial of Ĝ in terms of parameters of the graphs He and (in the one case) 0ow polynomials of subgraphs of G or (in the other case) tension polynomials o...

متن کامل

A Tutte polynomial for signed graphs

This paper introduces a generalization of the Tutte polynomial [14] that is defined for signed graphs. A signed graph is a graph whose edges are each labelled with a sign (+l or 1). The generalized polynomial will be denoted Q[G] = Q[G](A, B, d). Here G is the signed graph, and the letters A, B, d denote three independent polynomial variables. The polynomial Q[G] can be specialized to the Tutte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Discrete Mathematics

سال: 2011

ISSN: 1571-0653

DOI: 10.1016/j.endm.2011.10.007